Recognizing Dart - Free Perfect Graphs 1317
نویسنده
چکیده
A graph G is called a Berge graph if neither G nor its complement contains a chordless cycle whose length is odd and at least five; what we call a dart is the graph with vertices u, v, w, x, y and edges uv, vw, uy, vy, wy, xy; a graph is called dart-free if it has no induced subgraph isomorphic to the dart. We present a polynomial-time algorithm to recognize dart-free Berge graphs; this algorithm uses as a subroutine the polynomial-time algorithm for recognizing claw-free Berge graphs designed previously by Chvátal and Sbihi [J. Combin. Theory Ser. B, 44 (1988), pp. 154–176].
منابع مشابه
Recognizing the P4-structure of claw-free graphs and a larger graph class
The P4–structure of a graph G is a hypergraph H on the same vertex set such that four vertices form a hyperedge in H whenever they induce a P4 in G. We present a constructive algorithm which tests in polynomial time whether a given 4–uniform hypergraph is the P4–structure of a claw–free graph and of (banner,chair,dart)–free graphs. The algorithm relies on new structural results for (banner,chai...
متن کاملRecognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHDfree, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to dete...
متن کاملMaximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a ch...
متن کاملRecognizing HHD-free and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPOgraphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determin...
متن کاملThe P4-structure of perfect graphs
One of the most important outstanding open problems in algorithmic graph theory is to determine the complexity of recognizing perfect graphs. Results of Lovász [33], Padberg [37] and Bland et al. [6] imply, as was first observed by Cameron [10] in 1982, that the problem of recognizing perfect graphs is in co-NP. So far it is not known whether this problem also belongs to NP, i.e., we do not kno...
متن کامل